The Steiner ratio of high-dimensional Banach–Minkowski spaces

The Steiner Ratio of Metric Spaces

The Steiner Ratio of Banach-Minkowski spaces - A Survey

The Steiner Ratio of Banach Spaces - a survey

Steiner’s Problem is the ”Problem of shortest connectivity”, that means, given a finite set of points in a Banach space X, search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which are to be connected. Such points are called Steiner points. If we ...

The Steiner ratio of several discrete metric spaces

Steiner’s Problem is the “Problem of shortest connectivity”, that means, given a 3nite set of points in a metric space (X; ), search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices di5erent from the points which are to be connected. Such points are called Steiner points. If w...

Dimensionality reduction for density ratio estimation in high-dimensional spaces

The ratio of two probability density functions is becoming a quantity of interest these days in the machine learning and data mining communities since it can be used for various data processing tasks such as non-stationarity adaptation, outlier detection, and feature selection. Recently, several methods have been developed for directly estimating the density ratio without going through density ...